Octree Light Propagation Volumes

نویسندگان

  • John David Olovsson
  • Michael C. Doggett
چکیده

This paper presents a new method for representing Light Propagation Volumes using an octree data structure, and for allowing light from regular point light sources to be injected into them. The resulting technique uses full octrees with the help of a separate data structure for representing the octree structure. The octree structure enables light propagation to be performed at a lower resolution than the base resolution, resulting in fast propagation and overall faster rendering times. The implementation of the technique is capable of rendering the Sponza scene at 9 frames per second, which is 8% faster than the original LPV technique.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modelling and Rendering Large Volume Data with Gaussian Radial Basis Functions

Implicit representations have the potential to represent large volumes succinctly. In this paper we present a multiresolution and progressive implicit representation of scalar volumetric data using anisotropic Gaussian radial basis functions (RBFs) defined over an octree. Our representation lends itself well to progressive level-of-detail representations. Our RBF encoding algorithm based on a M...

متن کامل

Large-scale Northridge Earthquake Simulation Using Octree-based Multiresolution Mesh Method

Large scale ground motion simulation in realistic basins can benefit greatly from the use of parallel supercomputing systems in order to obtain reliable and useful results within reasonable elapsed time due to its large problem size. We present a parallel octree-based multiresolution finite element methodology for the elastodynamic wave propagation problem and develop a framework for large scal...

متن کامل

Volume octree with an implicitly defined dual grid

Volume data are usually represented as a uniform structured grid. Nevertheless, this representation imposes large memory requirements when large volumes are stored. Hierarchical representations, can be used to reduce either memory requirements or rendering time. Their use to store the volume model make the surface extraction process more complex, as cracks may appear on the boundary of cells wi...

متن کامل

Intersection-free Contouring on An Octree Grid

A method for extracting intersection-free iso-surfaces from volumetric data with an octree structure is presented. Unlike contouring techniques designed for uniform grids (such as Marching Cubes), adaptive contouring methods (such as Dual Contouring) can and do often generate intersecting polygons. Our main contribution is a polygon generation algorithm that produces triangles enclosed in nonov...

متن کامل

Balance refinement of massive linear octree datasets

Many applications that use octrees require that the octree decomposition be smooth throughout the domain with no sharp change in size between spatially adjacent octants, thus impose a so-called 2-to-l constraint on the octree datasets. The process of enforcing the 2-to-l constraint on an existing octree dataset is called balance refinement. Although it is relatively easy to conduct balance refi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013